Minimal Overlapping Patterns in Colored Permutations
نویسندگان
چکیده
منابع مشابه
Minimal Overlapping Patterns in Colored Permutations
A pattern P of length j has the minimal overlapping property if two consecutive occurrences of the pattern can overlap in at most one place, namely, at the end of the first consecutive occurrence of the pattern and at the start of the second consecutive occurrence of the pattern. For patterns P which have the minimal overlapping property, we derive a general formula for the generating function ...
متن کاملNote on Packing Patterns in Colored Permutations
Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to...
متن کاملCycles in the Graph of Overlapping Permutations Avoiding Barred Patterns
As a variation of De Bruijn graphs on strings of symbols, the graph of overlapping permutations has a directed edge π(1)π(2) . . . π(n+1) from the standardization of π(1)π(2) . . . π(n) to the standardization of π(2)π(3) . . . π(n + 1). In this paper, we consider the enumeration of d-cycles in the subgraph of overlapping (231, 41̄32)avoiding permutations. To this end, we introduce the notions of...
متن کاملLabeled partitions with colored permutations
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers ...
متن کاملAnalogues of Up-down Permutations for Colored Permutations
André proved that secx is the generating function of all up-down permutations of even length and tanx is the generating function of all up-down permutation of odd length. There are three equivalent ways to define up-down permutations in the symmetric group Sn. That is, a permutation σ in the symmetric group Sn is an updown permutation if either (i) the rise set of σ consists of all the odd numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/2021